On the average run length to false alarm in surveillance problems which possess an invariance structure
نویسندگان
چکیده
منابع مشابه
On the Average Run Length to False Alarm in Surveillance Problems which Possess an Invariance Structure
Surveillance can be based, in some change-point detection problems, on a sequence of invariant statistics. Gordon and Pollak (1997) prove that, under certain conditions, the Average Run Length (ARL) to false alarm of invariance-based Shiryayev-Roberts detection schemes is asymptotically the same as that of the dual classical scheme that is based on the original sequence of observations. In this...
متن کاملIs Average Run Length to False Alarm Always an Informative Criterion?
Apart from Bayesian approaches, the average run length (ARL) to false alarm has always been seen as the natural performance criterion for quantifying the propensity of a detection scheme to make false alarms, and no researchers seem to have questioned this on grounds that it does not always apply. In this article, we show that in the change-point problem with mixture pre-change models, detectio...
متن کاملthe effects of changing roughness on the flow structure in the bends
flow in natural river bends is a complex and turbulent phenomenon which affects the scour and sedimentations and causes an irregular bed topography on the bed. for the reason, the flow hydralics and the parameters which affect the flow to be studied and understand. in this study the effect of bed and wall roughness using the software fluent discussed in a sharp 90-degree flume bend with 40.3cm ...
On the Average Length of Visits to an Ergodic Set
Let X1,X2, . . . be a sequence of random variables which are stationary and ergodic (see Breiman [1968, p. 109]) with values in a set S. Let μk be the stationary distribution for a sequence of length k so that for any fixed collection A1, A2, . . . , Ak of subsets of s, μk(A1, A2, . . . , Ak) = P[Xn ∈ A1,Xn+1 ∈ A2, . . . ,Xn+k−1 ∈ Ak] is independent of n, n = 1, 2, . . . . Now let B be a subset...
متن کاملFalse Alarm Constrained Classification
In classification problems, the goal is often to maximize the probability of a true positive while satisfying a system design constraint on the number of false alarms. Current classifiers, which are based on minimizing classification error, achieve this goal indirectly by either shifting the bias of the resulting solution or via tuning of an asymmetry parameter. While these approaches may be us...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Statistics
سال: 1998
ISSN: 0090-5364
DOI: 10.1214/aos/1024691095